Derivation of continuous zoomable road network maps through utilization of Space-Scale-Cube

The process of performing cartographic generalization in an automatic way applied on geographic information is of highly interest in the field of cartography, both in academia and industry. Many research e↵orts have been done to implement di↵erent automatic generalization approaches. Being able to answer the research question on automatic generalization, another interesting question opens up: ”Is it possible to retrieve and visualize geographic information in any arbitrary scale?” This is the question in the field of vario-scale geoinformation. Potential research works should answer this question with solutions which provide valid and efficient representation of geoinformation in any on-demand scale. More brilliant solutions will also provide smooth transitions between these on-demand arbitrary scales. Space-Scale-Cube (Meijers and Van Oosterom 2011) is a reactive tree (Van Oosterom 1991) data structure which shows positive potential for achieving smooth automatic vario-scale generalization of area features. The topic of this research work is investigation of adaptation of this approach on an interesting class of geographic information: road networks datasets. Firstly theoretical background will be introduced and discussed and afterwards, implementing the adaptation would be described. This research work includes development of a hierarchical data structure based on road network datasets and the potential use of this data structure in vario-scale geoinformation retrieval and visualization.:Declaration of Authorship i Abstract iii Acknowledgements iv List of Figures vii Abbreviations viii 1 Introduction 1 1.1 Problem Definition 2 1.1.1 Research Questions 2 1.1.2 Objectives 3 1.2 Proposed Solution 3 1.3 Structure of the Thesis 4 1.4 Notes on Terminology 4 2 Cartographic Generalization 6 2.1 Cartographic Generalization: Definitions and Classifications 6 2.2 Generalization Operators 9 2.3 Efforts on Vario-Scale Visualization of Geoinformation 10 2.4 Efforts on Generalization of Road Networks and Similar Other Networks 16 2.4.1 Geometric Generalization of Networks 17 2.4.2 Model Generalization of Networks 18 2.5 Clarification of Interest 20 3 Theory of Road Network SSC 21 3.1 Background of an SSC 21 3.1.1 tGAP 21 3.1.2 Smoothing tGAP 23 3.2 Road Network as a ’Network’ 24 3.2.1 Short Background on Graph Theory 5 3.3 Formation of Road Network SSC 26 3.3.1 Geometry 26 3.3.2 Network Topology 27 3.3.3 Building up tGAP on The Road Network 28 3.3.4 Smoothing of Road Network SSC 31 3.3.4.1 Smoothing Elimination 32 3.3.4.2 Smoothing Simplification 32 3.4 Reading from a road network SSC 34 3.4.1 Discussion on Scale 34 3.4.2 Iterating Over The Forest 35 3.4.3 Planar Slices 35 3.4.4 Non-Planar Slices 36 4 Implementation of Road Network SSC 37 4.1 General Information Regarding The Implementation 37 4.1.1 Programming Language 37 4.1.2 RDBMS 38 4.1.3 Geometry Library 39 4.1.4 Graph Library 39 4.2 Data Structure 40 4.2.1 Node 40 4.2.2 Edge 41 4.2.3 Edge-Node-Relation 41 4.3 Software Architecture 42 4.3.1 More Detail on Building The SSC 42 4.3.1.1 Initial Data Processing 42 4.3.1.2 Network Processing 43 4.3.2 More Detail on Querying The SSC 46 4.3.2.1 Database Query 46 4.3.2.2 Building Geometry 46 4.3.2.3 Interface and Visualization 47 4.4 Results 48 5 Conclusions and Outlook 49 Bibliography 5

Abstraction and cartographic generalization of geographic user-generated content: use-case motivated investigations for mobile users

On a daily basis, a conventional internet user queries different internet services (available on different platforms) to gather information and make decisions. In most cases, knowingly or not, this user consumes data that has been generated by other internet users about his/her topic of interest (e.g. an ideal holiday destination with a family traveling by a van for 10 days). Commercial service providers, such as search engines, travel booking websites, video-on-demand providers, food takeaway mobile apps and the like, have found it useful to rely on the data provided by other users who have commonalities with the querying user. Examples of commonalities are demography, location, interests, internet address, etc. This process has been in practice for more than a decade and helps the service providers to tailor their results based on the collective experience of the contributors. There has been also interest in the different research communities (including GIScience) to analyze and understand the data generated by internet users. The research focus of this thesis is on finding answers for real-world problems in which a user interacts with geographic information. The interactions can be in the form of exploration, querying, zooming and panning, to name but a few. We have aimed our research at investigating the potential of using geographic user-generated content to provide new ways of preparing and visualizing these data. Based on different scenarios that fulfill user needs, we have investigated the potential of finding new visual methods relevant to each scenario. The methods proposed are mainly based on pre-processing and analyzing data that has been offered by data providers (both commercial and non-profit organizations). But in all cases, the contribution of the data was done by ordinary internet users in an active way (compared to passive data collections done by sensors). The main contributions of this thesis are the proposals for new ways of abstracting geographic information based on user-generated content contributions. Addressing different use-case scenarios and based on different input parameters, data granularities and evidently geographic scales, we have provided proposals for contemporary users (with a focus on the users of location-based services, or LBS). The findings are based on different methods such as semantic analysis, density analysis and data enrichment. In the case of realization of the findings of this dissertation, LBS users will benefit from the findings by being able to explore large amounts of geographic information in more abstract and aggregated ways and get their results based on the contributions of other users. The research outcomes can be classified in the intersection between cartography, LBS and GIScience. Based on our first use case we have proposed the inclusion of an extended semantic measure directly in the classic map generalization process. In our second use case we have focused on simplifying geographic data depiction by reducing the amount of information using a density-triggered method. And finally, the third use case was focused on summarizing and visually representing relatively large amounts of information by depicting geographic objects matched to the salient topics emerged from the data

Tappigraphy: continuous ambulatory assessment and analysis of in-situ map app use behaviour

While map apps on smartphones are abundant, their everyday usage is still an open empirical research question. With tappigraphy – the quantification of smartphone touchscreen interactions – we aimed to capture continuous data stream of behavioural human-map app usage patterns. The current study introduces a first tappigraphy analysis of the distribution of touchscreen interactions on map apps in 211 remotely observed smartphone users, accumulating a total of 42 days of tap data. We detail the requirements, setup, and data collection to understand how much, when, for how long, and how people use mobile map apps in their daily lives. Supporting prior research, we find that on average map apps are only sparsely used, compared to other apps. The longitudinal fluctuations in map use are not random and are partly governed by general daily and weekly human behaviour cycles. Smartphone session duration including map app use can be clearly distinguished from sessions without any map apps used, indicating a distinct temporal behavioural footprint surrounding map use. With the transfer of the tappigraphy approach to a mobile map app use context, we see a promising avenue to provide research communities interested in the underlying behavioural mechanisms of map use a continuous, in-situ momentary assessment method

Derivation of continuous zoomable road network maps through utilization of Space-Scale-Cube

The process of performing cartographic generalization in an automatic way applied on geographic information is of highly interest in the field of cartography, both in academia and industry. Many research e↵orts have been done to implement di↵erent automatic generalization approaches. Being able to answer the research question on automatic generalization, another interesting question opens up: ”Is it possible to retrieve and visualize geographic information in any arbitrary scale?” This is the question in the field of vario-scale geoinformation. Potential research works should answer this question with solutions which provide valid and efficient representation of geoinformation in any on-demand scale. More brilliant solutions will also provide smooth transitions between these on-demand arbitrary scales. Space-Scale-Cube (Meijers and Van Oosterom 2011) is a reactive tree (Van Oosterom 1991) data structure which shows positive potential for achieving smooth automatic vario-scale generalization of area features. The topic of this research work is investigation of adaptation of this approach on an interesting class of geographic information: road networks datasets. Firstly theoretical background will be introduced and discussed and afterwards, implementing the adaptation would be described. This research work includes development of a hierarchical data structure based on road network datasets and the potential use of this data structure in vario-scale geoinformation retrieval and visualization.:Declaration of Authorship i Abstract iii Acknowledgements iv List of Figures vii Abbreviations viii 1 Introduction 1 1.1 Problem Definition 2 1.1.1 Research Questions 2 1.1.2 Objectives 3 1.2 Proposed Solution 3 1.3 Structure of the Thesis 4 1.4 Notes on Terminology 4 2 Cartographic Generalization 6 2.1 Cartographic Generalization: Definitions and Classifications 6 2.2 Generalization Operators 9 2.3 Efforts on Vario-Scale Visualization of Geoinformation 10 2.4 Efforts on Generalization of Road Networks and Similar Other Networks 16 2.4.1 Geometric Generalization of Networks 17 2.4.2 Model Generalization of Networks 18 2.5 Clarification of Interest 20 3 Theory of Road Network SSC 21 3.1 Background of an SSC 21 3.1.1 tGAP 21 3.1.2 Smoothing tGAP 23 3.2 Road Network as a ’Network’ 24 3.2.1 Short Background on Graph Theory 5 3.3 Formation of Road Network SSC 26 3.3.1 Geometry 26 3.3.2 Network Topology 27 3.3.3 Building up tGAP on The Road Network 28 3.3.4 Smoothing of Road Network SSC 31 3.3.4.1 Smoothing Elimination 32 3.3.4.2 Smoothing Simplification 32 3.4 Reading from a road network SSC 34 3.4.1 Discussion on Scale 34 3.4.2 Iterating Over The Forest 35 3.4.3 Planar Slices 35 3.4.4 Non-Planar Slices 36 4 Implementation of Road Network SSC 37 4.1 General Information Regarding The Implementation 37 4.1.1 Programming Language 37 4.1.2 RDBMS 38 4.1.3 Geometry Library 39 4.1.4 Graph Library 39 4.2 Data Structure 40 4.2.1 Node 40 4.2.2 Edge 41 4.2.3 Edge-Node-Relation 41 4.3 Software Architecture 42 4.3.1 More Detail on Building The SSC 42 4.3.1.1 Initial Data Processing 42 4.3.1.2 Network Processing 43 4.3.2 More Detail on Querying The SSC 46 4.3.2.1 Database Query 46 4.3.2.2 Building Geometry 46 4.3.2.3 Interface and Visualization 47 4.4 Results 48 5 Conclusions and Outlook 49 Bibliography 5

Derivation of continuous zoomable road network maps through utilization of Space-Scale-Cube

The process of performing cartographic generalization in an automatic way applied on geographic information is of highly interest in the field of cartography, both in academia and industry. Many research e↵orts have been done to implement di↵erent automatic generalization approaches. Being able to answer the research question on automatic generalization, another interesting question opens up: ”Is it possible to retrieve and visualize geographic information in any arbitrary scale?” This is the question in the field of vario-scale geoinformation. Potential research works should answer this question with solutions which provide valid and efficient representation of geoinformation in any on-demand scale. More brilliant solutions will also provide smooth transitions between these on-demand arbitrary scales. Space-Scale-Cube (Meijers and Van Oosterom 2011) is a reactive tree (Van Oosterom 1991) data structure which shows positive potential for achieving smooth automatic vario-scale generalization of area features. The topic of this research work is investigation of adaptation of this approach on an interesting class of geographic information: road networks datasets. Firstly theoretical background will be introduced and discussed and afterwards, implementing the adaptation would be described. This research work includes development of a hierarchical data structure based on road network datasets and the potential use of this data structure in vario-scale geoinformation retrieval and visualization.:Declaration of Authorship i Abstract iii Acknowledgements iv List of Figures vii Abbreviations viii 1 Introduction 1 1.1 Problem Definition 2 1.1.1 Research Questions 2 1.1.2 Objectives 3 1.2 Proposed Solution 3 1.3 Structure of the Thesis 4 1.4 Notes on Terminology 4 2 Cartographic Generalization 6 2.1 Cartographic Generalization: Definitions and Classifications 6 2.2 Generalization Operators 9 2.3 Efforts on Vario-Scale Visualization of Geoinformation 10 2.4 Efforts on Generalization of Road Networks and Similar Other Networks 16 2.4.1 Geometric Generalization of Networks 17 2.4.2 Model Generalization of Networks 18 2.5 Clarification of Interest 20 3 Theory of Road Network SSC 21 3.1 Background of an SSC 21 3.1.1 tGAP 21 3.1.2 Smoothing tGAP 23 3.2 Road Network as a ’Network’ 24 3.2.1 Short Background on Graph Theory 5 3.3 Formation of Road Network SSC 26 3.3.1 Geometry 26 3.3.2 Network Topology 27 3.3.3 Building up tGAP on The Road Network 28 3.3.4 Smoothing of Road Network SSC 31 3.3.4.1 Smoothing Elimination 32 3.3.4.2 Smoothing Simplification 32 3.4 Reading from a road network SSC 34 3.4.1 Discussion on Scale 34 3.4.2 Iterating Over The Forest 35 3.4.3 Planar Slices 35 3.4.4 Non-Planar Slices 36 4 Implementation of Road Network SSC 37 4.1 General Information Regarding The Implementation 37 4.1.1 Programming Language 37 4.1.2 RDBMS 38 4.1.3 Geometry Library 39 4.1.4 Graph Library 39 4.2 Data Structure 40 4.2.1 Node 40 4.2.2 Edge 41 4.2.3 Edge-Node-Relation 41 4.3 Software Architecture 42 4.3.1 More Detail on Building The SSC 42 4.3.1.1 Initial Data Processing 42 4.3.1.2 Network Processing 43 4.3.2 More Detail on Querying The SSC 46 4.3.2.1 Database Query 46 4.3.2.2 Building Geometry 46 4.3.2.3 Interface and Visualization 47 4.4 Results 48 5 Conclusions and Outlook 49 Bibliography 5

Geological map generalization driven by size constraints

Geological maps are an important information source used in the support of activities relating to mining, earth resources, hazards, and environmental studies. Owing to the complexity of this particular map type, the process of geological map generalization has not been comprehensively addressed, and thus a complete automated system for geological map generalization is not yet available. In particular, while in other areas of map generalization constraint-based techniques have become the prevailing approach in the past two decades, generalization methods for geological maps have rarely adopted this approach. This paper seeks to fill this gap by presenting a methodology for the automation of geological map generalization that builds on size constraints (i.e., constraints that deal with the minimum area and distance relations in individual or pairs of map features). The methodology starts by modeling relevant size constraints and then uses a workflow consisting of generalization operators that respond to violations of size constraints (elimination/selection, enlargement, aggregation, and displacement) as well as algorithms to implement these operators. We show that the automation of geological map generalization is possible using constraint-based modeling, leading to improved process control compared to current approaches. However, we also show the limitations of an approach that is solely based on size constraints and identify extensions for a more complete workflow

Integration of folksonomies into the process of map generalization

The growth of user-generated content in quantity and quality has changed the way people use digital services, including geo-services. The process of map generalization is not an exception to this phenomenon. Earlier research has considered user-generated content as data sources for the generalization process. However, little work has been accomplished to date considering the knowledge that may be extracted from those sources, in particular from special place-related semantics captured in user-contributed feature tags. This study considers doing so from the perspective of folksonomies, presenting some first steps in that direction. In particular, this short paper shows, on the example of OpenStreetMap, how different similarity measures can be used to exploit folksonomy-based semantics in map generalization. And it shows how these semantics can be used to introduce behaviour changes in generalization operators, in particular in the selection and aggregation operators, respectively

Geological Map Generalization Driven by Size Constraints

Geological maps are an important information source used in the support of activities relating to mining, earth resources, hazards, and environmental studies. Owing to the complexity of this particular map type, the process of geological map generalization has not been comprehensively addressed, and thus a complete automated system for geological map generalization is not yet available. In particular, while in other areas of map generalization constraint-based techniques have become the prevailing approach in the past two decades, generalization methods for geological maps have rarely adopted this approach. This paper seeks to fill this gap by presenting a methodology for the automation of geological map generalization that builds on size constraints (i.e., constraints that deal with the minimum area and distance relations in individual or pairs of map features). The methodology starts by modeling relevant size constraints and then uses a workflow consisting of generalization operators that respond to violations of size constraints (elimination/selection, enlargement, aggregation, and displacement) as well as algorithms to implement these operators. We show that the automation of geological map generalization is possible using constraint-based modeling, leading to improved process control compared to current approaches. However, we also show the limitations of an approach that is solely based on size constraints and identify extensions for a more complete workflow